Finding the Next Solution in Constraint- and Preference-Based Knowledge Representation Formalisms
نویسندگان
چکیده
In constraint or preference reasoning, a typical task is to compute a solution, or an optimal solution. However, when one has already a solution, it may be important to produce the next solution following the given one in a linearization of the solution ordering, where more preferred solutions are ordered first. In this paper, we study the computational complexity of finding the next solution in some common preference-based representation formalisms. We show that this problem is hard in general CSPs, but it can be easy in tree-shaped CSPs and tree-shaped fuzzy CSPs. However, it is difficult in weighted CSPs, even if we restrict the shape of the constraint graph. We also consider CP-nets, showing that the problem is easy in acyclic CP-nets, as well as in constrained acyclic CP-nets where the (soft) constraints are tree-shaped and topologically compatible with the CP-net.
منابع مشابه
Reasoning with Comparative Preferences in Combinatorial Problems
Many decision making problems involve choosing a preferred option amongst a large number of alternatives, which are structured in terms of a number of variables, with each alternative associating a value with each variable. The set of possible alternatives may be defined implicitly, as the (typically exponentially large) set of solutions of a Constraint Satisfaction Problem; or explicitly as a ...
متن کاملA Multi-Formalism Modeling Framework: Formal Definitions, Model Composition and Solution Strategies
In this paper, we present a multi-formalism modeling framework (abbreviated by MFMF) for modeling and simulation. The proposed framework is defined based on the concepts of meta-models and uses object-orientation to overcome the complexities and to enhance the extensibility. The framework can be used as a basis for modeling by various formalisms and to support model composition in a unified man...
متن کاملA Multi-Formalism Modeling Framework: Formal Definitions, Model Composition and Solution Strategies
In this paper, we present a multi-formalism modeling framework (abbreviated by MFMF) for modeling and simulation. The proposed framework is defined based on the concepts of meta-models and uses object-orientation to overcome the complexities and to enhance the extensibility. The framework can be used as a basis for modeling by various formalisms and to support model composition in a unified man...
متن کاملReprésentation de connaissances complexes : Un formalisme à base de rôles sémantiques. (Complex knowledge representation: a formalism based on semantic roles)
The work presented in this thesis deals with knowledge representation. It forms part of the AMICAL project (Interactive Multi-agents Architecture Learning-to-Read Companion) whose purpose is the development of an computer-aided learning-to-read environment. This study focuses on the search for a semantic representation of texts used in learning sessions. The problem is to find a knowledge repre...
متن کاملOrdinal Constraint Satisfaction
We propose a new CSP formalism that incorporates hard constraints and preferences so that the two are easily distinguished both conceptually and for purposes of problem solving. Preferences are represented as a lexicographic order over variables and domain values, respectively. Constraints are treated in the usual manner. Therefore, these problems can be solved with ordinary CSP algorithms, wit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010